Unified reciprocal LASSO estimation via least squares approximation

نویسندگان

چکیده

The primary goal of this article is to extend the reciprocal LASSO for applications binary and survival outcomes. We consider least squares approximation (LSA) as a solver problem. LSA general theoretical framework that includes generalized linear models, Cox regression, many others special cases. By applying regularization, we transfer original problem into an asymptotically equivalent While existing literature on has mostly focused our algorithm can be easily implemented likelihoods, providing flexible variable selection using penalties. To handle computational burden implementing resulting procedure, employ scalable stochastic search method called Simplified Shotgun Stochastic Search with Screening (S5), which easy implement, without requiring any sophisticated optimization package other than equation solver. examine effectiveness procedure through Monte Carlo simulations real data analyses.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unified LASSO Estimation via Least Squares Approximation

We propose a method of least squares approximation (LSA) for unified yet simple LASSO estimation. Our general theoretical framework includes ordinary least squares, generalized linear models, quantile regression, and many others as special cases. Specifically, LSA can transfer many different types of LASSO objective functions into their asymptotically equivalent least-squares problems. Thereaft...

متن کامل

Fast Subspace Approximation via Greedy Least-Squares

In this note, we develop fast and deterministic dimensionality reduction techniques for a family of subspace approximation problems. Let P ⊂ R be a given set of M points. The techniques developed herein find an O(n logM)-dimensional subspace that is guaranteed to always contain a near-best fit n-dimensional hyperplane H for P with respect to the cumulative projection error (∑ x∈P ‖x−ΠHx‖ p 2 )1...

متن کامل

Least Squares Approximation

In many applications we want to find an approximation for a function, for example for differential equations. Example problem: We want to understand how a calculator or computer can evaluate sinx for a given value x. The processor can essentially only perform addition, multiplication, division. Therefore we can try to approximate the function with a polynomial. We use the notation Pn for polyno...

متن کامل

Least-squares polynomial approximation

We construct symmetric polar WAMs (Weakly Admissible Meshes) with low cardinality for least-squares polynomial approximation on the disk. These are then mapped to an arbitrary triangle. Numerical tests show that the growth of the least-squares projection uniform norm is much slower than the theoretical bound, and even slower than that of the Lebesgue constant of the best known interpolation poi...

متن کامل

Faster Least Squares Approximation

Least squares approximation is a technique to find an approximate solution to a system of linear equations that has no exact solution. In a typical setting, one lets n be the number of constraints and d be the number of variables, with n d. Then, existing exact methods find a solution vector in O(nd2) time. We present two randomized algorithms that provide accurate relative-error approximations...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Communications in Statistics - Simulation and Computation

سال: 2022

ISSN: ['0361-0918', '1532-4141']

DOI: https://doi.org/10.1080/03610918.2022.2146723